<HTML><HEAD><TITLE>library(all_min_cuts)</TITLE></HEAD><BODY>
[ <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]<H1>library(all_min_cuts)</H1>
Curet et al, algorithm for generating all minimum-cost cuts
<H2>Predicates</H2>
<BLOCKQUOTE>
<DL>
<DT><A HREF="all_min_cuts-8.html"><STRONG>all_min_cuts(+Graph, +CapacityArg, +SourceNode, +SinkNode, -MaxFlowValue, -MaxFlowEdges, -MinCuts, -MinCutEdges)</STRONG></A></DT>
<DD>Curet et al, algorithm for generating all minimum-cost cuts</DD>
<DT><A HREF="all_min_cuts-9.html"><STRONG>all_min_cuts(+Graph, +CapacityArg, +SourceNode, +SinkNode, +Limit, -MaxFlowValue, -MaxFlowEdges, -MinCuts, -MinCutEdges)</STRONG></A></DT>
<DD>Curet et al, algorithm for generating all minimum-cost cuts, with limit for max number of allowed cuts</DD>
<DT><A HREF="all_min_cuts_list-5.html"><STRONG>all_min_cuts_list(+Graph, +CapacityArg, +SourceSinkList, +Limit, -MinCutEdgesList)</STRONG></A></DT>
<DD>Curet et al, algorithm for generating all minimum-cost cuts, to be used for multiple source-sink pairs on the same graph since unnecessary repeat of initializations can be avoided</DD>
</DL>
</BLOCKQUOTE>
<H2>Description</H2>
Algorithm for generating all minimum-cost cuts between source and sink. From Norman D. Curet, Jason DeVinney, Matthew E. Gaston. An efficient network flow code for finding all minimum cost s-t cutsets. Computers &amp; Operations Research 29 (2002) 205-219. 
<H2>About</H2><UL COMPACT>
<LI><STRONG>Status: </STRONG>prototype
<LI><STRONG>Author: </STRONG>CrossCore Optimization Ltd
<LI><STRONG>Copyright &copy; </STRONG>2007, CrossCore Optimization Ltd
<LI><STRONG>Date: </STRONG>2006-2007
</UL>
<HR>Generated from all_min_cuts.eci on 2009-05-27 01:25
</BODY></HTML>
